First Passage Percolation Has Sublinear Distance Variance
نویسندگان
چکیده
Let 0 < a < b < ∞, and for each edge e of Zd let ωe = a or ωe = b, each with probability 1/2, independently. This induces a random metric distω on the vertices of Z d, called first passage percolation. We prove that for d > 1 the distance distω(0, v) from the origin to a vertex v, |v| > 2, has variance bounded by C |v|/ log |v|, where C = C(a, b, d) is a constant which may only depend on a, b and d. Some related variants are also discussed.
منابع مشابه
Sublinear variance for directed last-passage percolation
A range of first-passage percolation type models are believed to demonstrate the related properties of sublinear variance and superdiffusivity. We show that directed last-passage percolation with Gaussian vertex weights has a sublinear variance property. We also consider other vertex weight distributions. Corresponding results are obtained for the ground state of the ‘directed polymers in a ran...
متن کاملSublinear Distance Variance
Let 0 < a < b < ∞, and for each edge e of Zd let ωe = a or ωe = b, each with probability 1/2, independently. This induces a random metric distω on the vertices of Z d, called first passage percolation. We prove that for d > 1 the distance distω(0, v) from the origin to a vertex v, |v| > 2, has variance bounded by C |v|/ log |v|, where C = C(a, b, d) is a constant which may only depend on a, b a...
متن کاملOn the Markov Transition Kernels for First Passage Percolation on the Ladder
We consider the first passage percolation problem on the random graph with vertex set N×{0, 1}, edges joining vertices at a Euclidean distance equal to unity, and independent exponential edgeweights. We provide a central limit theorem for the first passage times ln between the vertices (0, 0) and (n, 0), thus extending earlier results about the almost-sure convergence of ln/n as n → ∞. We use g...
متن کاملPlanar first-passage percolation times are not tight
We consider first-passage percolation on the two-dimensional integer lattice Z2 with passage times that are IID exponentials of mean one; see Kesten (1986) for an overview. It has been conjectured, based on numerical evidence, that the variance of the time T (0, n) to reach the vertex (0, n) is of order n2/3. Kesten (1992) showed that the variance of T (0, n) is at O(n). He also noted that the ...
متن کاملFirst passage percolation on random graphs with finite mean degrees
We study first passage percolation on the configuration model. Assuming that each edge has anindependent exponentially distributed edge weight, we derive explicit distributional asymptotics forthe minimum weight between two randomly chosen connected vertices in the network, as well as forthe number of edges on the least weight path, the so-called hopcount.We analyze the conf...
متن کامل